A Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm
نویسندگان
چکیده
We reprove that all the matchings constructed during Edmonds’ weighted perfect matching algorithm are optimal among those of the same cardinality (provided that certain mild restrictions are obeyed on the choices the algorithm makes). We conclude that in order to solve a weighted matching problem it is not needed to solve a weighted perfect matching problem in an auxiliary graph of doubled size. This result was known before, e.g., posed as an exercise in see Lawler’s book from 1976, but is not present in several modern books on combinatorial optimization.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملKönig-Egerváry Graphs are Non-Edmonds
König-Egerváry graphs are those whose maximum matchings are equicardinal to their minimumorder coverings by vertices. Edmonds [J. Res. Nat. Bur. Standards Sect. B 69B (1965), 125–130] characterized the perfect matching polytope of a graph G = (V,E) as the set of nonnegative vectors x ∈ R satisfying two families of constraints: ‘vertex saturation’ and ‘blossom’. Graphs for which the latter const...
متن کاملThe Third Proof of Lovász's Cathedral Theorem
This paper is on matching theory. A graph with perfect matching is called saturated if any addition of one complement edge creates a new perfect matching. Lovász gave a characterization of the saturated graphs called the cathedral theorem, and later Szigeti gave another proof. In this paper, we gave a new proof with our preceding works, which revealed the canonical structure of general graph wi...
متن کاملAn Alternative Proof of Lovász’s Cathedral Theorem
A graph G with a perfect matching is called saturated if G + e has more perfect matchings than G for any edge e that is not in G. Lovász gave a characterization of the saturated graphs called the cathedral theorem, with some applications to the enumeration problem of perfect matchings, and later Szigeti gave another proof. In this paper, we give a new proof with our preceding works which reveal...
متن کاملLoop Calculus and Bootstrap-Belief Propagation for Perfect Matchings on Arbitrary Graphs
This manuscript discusses computation of the Partition Function (PF) and theMinimumWeight Perfect Matching (MWPM) on arbitrary, non-bipartite graphs. We present two novel problem formulations one for computing the PF of a Perfect Matching (PM) and one for finding MWPMs that build upon the inter-related Bethe Free Energy (BFE), Belief Propagation (BP), Loop Calculus (LC), Integer Linear Programm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1703.09505 شماره
صفحات -
تاریخ انتشار 2017